Cocovering and Set Forcing
نویسنده
چکیده
1. Introduction Let V [G] be the result of adding a Cohen real and a Cohen subset of ω 2 to a model V of the GCH. Every infinite cardinal gets a new subset in V [G], namely, the Cohen real. Yet, in some sense, only ω and ω 2 get new subsets. One way to capture this is to say that a sort of dual to Covering holds between V and V [G], namely, " κ-cocovering " for κ other than ω and ω 2. We need some definitions. If κ is a regular cardinal in V , say that κ-cocovering holds between V and the outer model W if, given any unbounded a ⊆ κ that lies in W , there exists b ∈ V such that b ⊆ a and b is unbounded in κ. If V is a standard transitive model of ZFC, say that W ⊇ V is an outer model of V if W is also a standard transitive model of ZFC and V ∩ OR = W ∩ OR. In this paper we are only concerned with outer models such that (W ; V) satisfies ZFC (in a language with a predicate symbol for V). Ultimately, ZFC is our metatheory; talk of models can be understood as talk of set, or even countable set models. The reader will note that our results usually can be paraphrased in more traditional terminology, perhaps at the cost of some generality. This paper proves a sort of converse to the observation with which we began. The general case is not quite so simple as this example suggests. We show that if W is any outer model of V , and sufficient cocovering (and maybe a little covering) hold around κ, then every subset of κ that lies in W is set generic over V for a forcing of V-cardinality less than κ. To be precise, let us begin with a special case in which we assume a little of the GCH in the inner model V. Corollary 2.12 draws the following corollary of our main theorem. Theorem. Assume that • in V : κ is regular, κ <κ = κ, and 2 κ = κ +. Also assume that • both κ and κ +-cocovering hold between V and W. Then every subset of κ + that lies in W is set generic over V for a …
منابع مشابه
Fuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کامل